Distance-sensitive scheduling of TDM-over-packet traffic in VPLS

ABSTRACT

A method of scheduling high-priority packets in a metro Ethernet switch is described. In one embodiment, the method comprises the steps of determining a maximum queuing delay allowed for at least two high-priority packets in an output queue in the switch; determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.

BACKGROUND OF THE INVENTION

1. Technical Field of the Invention

The present invention generally relates to transmission of Time Division Multiplex (“TDM”) traffic over packet switched networks in Virtual Private LAN Service (“VPLS”). More particularly, and not by way of any limitation, the present invention is directed to method and apparatus for distance-sensitive scheduling of such high-priority traffic.

2. Description of Related Art

Time Division Multiplex (“TDM”) technology has been prevalent for a long time; however, the technology for transmitting TDM traffic over packet networks is relatively new. Accordingly, there are few solutions that address the problem of delay for TDM traffic when it is sent over a packet network. One solution addresses the delay that results from sending a large TDM packet over a packet network using a common switch fabric resource for TDM and packet switching. In particular, large packets or data streams are divided into smaller portions upon entering a switch. Each portion is assigned a high priority for transmission and a tracking header for tracking it through the switch. Prior to exiting the switch, the portions are reassembled into the data stream. This technique of providing “cut-through” using a store-and-forward switch mechanism reduces transmission delay and buffer over-runs that would otherwise occur in transmitting large packets or data streams. This solution strictly addresses the problem of sending only large TDM packets and does not address the specific problem of prioritizing between traffic from multiple TDM streams in a VPLS network.

Another solution involves the use of a multi-port link interface module that terminates two or more high-speed TDM links and generates internal data. Data received on one high-speed communications link is combined with the internal data used to fill outbound time slots in an outgoing high-speed link. This solution fails to address the issues of delay when sending TDM traffic over a packet network.

Currently, TDM traffic, such as voice, when sent over a packet network may suffer unacceptable delay and jitter due to multiplexing with packet data. The benefits of low cost and high bandwidth utilization of packet data networks may be offset by the poor performance of TDM traffic when sent over packet networks.

Existing traffic scheduling mechanisms that prioritize one class of traffic over another do not address the problem because all TDM traffic belongs to a single high-priority traffic class. Existing methods do not preferentially prioritize traffic within a class.

SUMMARY OF THE INVENTION

One embodiment is a method of scheduling high-priority packets in a metro Ethernet switch. The method comprises the steps of determining a maximum queuing delay allowed for at least two high-priority packets in an output queue in the switch; determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.

Another embodiment is a method of scheduling high-priority packets in a metro Ethernet switch. The method comprises the steps of creating a first table that lists, for each high-priority packet that has entered the switch, a position of the high-priority packet in a queue of the switch, a time the high-priority packet entered the queue, and an intended destination of the high-priority packet; creating a second table for storing a maximum allowed queuing delay for each of several possible intended destinations; and using the first and second tables to determine the maximum queuing delay allowed for each of the high-priority packets in the queue of the switch.

Another embodiment is an apparatus for scheduling high-priority packets in a metro Ethernet switch. The apparatus comprises means for determining a maximum queuing delay allowed for at least two high-priority packets in a queue in the switch; means for determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and means for scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.

Another embodiment is a packet switch comprising a queue containing a plurality of packets received at the switch; and a scheduler for scheduling transmission of the packets in the queue, wherein when the queue contains at least two high-priority packets, the scheduler schedules the one of the at least two high-priority packets determined to have a smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the present invention may be had by reference to the following Detailed Description when taken in conjunction with the accompanying drawings wherein:

FIG. 1 is a block diagram of a VPLS network with a fully-connected label switched path (“LSP”) mesh;

FIG. 2 illustrates the concept of transmission and propagation delay between two provider edge (“PE”) nodes of a VPLS network; and

FIG. 3 is a flowchart of the operation of one embodiment for performing distance-sensitive scheduling of TDM-over-packet traffic in VPLS.

DETAILED DESCRIPTION OF THE DRAWINGS

In the drawings, like or similar elements are designated with identical reference numerals throughout the several views thereof, and the various elements depicted are not necessarily drawn to scale. It will be appreciated that the inventive concepts described herein are applicable to any VPLS network; however, representative values for delay, etc., have been selected to illustrate those concepts.

FIG. 1 illustrates a VPLS network with a fully connected LSP mesh, designated in FIG. 1 by a reference numeral 100. The VPLS network 100 comprises N provider edge (“PE”) nodes, represented by five nodes PE1-PE5, fully interconnected by an LSP mesh comprising N×(N−1) point-to-point LSPs 104(1)-104(20). TDM traffic may be carried on one or more of the LSPs 104(1)-104(20) as a component of high-priority traffic. The actual values for the delay requirements of such traffic may vary.

Although not shown in FIG. 1, it will be recognized that there may be intermediate nodes, in particular, provider (“P”) nodes, disposed along the LSPs between the PE nodes PE1-PE5. Accordingly, packets destined for different destinations will have to go through a number of hops from ingress PE node to egress PE node. For example, a packet from the node PE1 to the node PE2 may traverse three intermediate P nodes, making the LSP 104(2) a three-hop path; a packet from the node PE1 to the node PE3 may traverse seven intermediate nodes, making the LSP 104(14) a seven-hop path. As a result of this, packets will undergo different delays depending on which LSP 104(1)-104(20) they traverse through the network 100. This situation could be detrimental in the case of packetized TDM traffic or any traffic that is highly sensitive to delay and jitter.

Customer edge (“CE”) nodes, represented in FIG. 1 by CE nodes 106, are connected to PE nodes for connecting end users to the network 100.

In the scenario described herein where the VPLS network 100 is actually built using an Ethernet switch, a high-priority queue at the node PE1, for example, will have TDM packets that are destined for the node PE2 via the LSP 104(2) (a three-hop path) and packets that are destined for the node PE3 via the LSP 104(14) (a seven-hop path). Hence, the two packets will experience different delays from network ingress to network egress.

It will be assumed that all of the nodes PE1-PE5 have input queuing. Packets are queued at the input buffers before being scheduled. It will be further assumed that in the illustrated example, there is head-of-the-line blocking and to avoid that, each queue at a node PE1-PE5 is capable of performing an n-packet look-ahead to schedule the packets that may be blocked behind another packet. In one embodiment, this architecture is implemented at the Ethernet switch and n is equal to four. The packetized TDM traffic will be treated as high-priority traffic and will be placed into a high-priority queue.

The basic solution described herein is to introduce an additional prioritization, referred to herein as “relative prioritization”, which is valid only within the high-priority class of traffic. This relative prioritization pertains to the number of hops the packet will traverse and hence the delay that the packet will incur. For instance, packets that are destined for nodes that are many hops away will be given priority in transporting them through the high-priority input queue. The information concerning the number of hops is readily available through the VPLS model. Accordingly, this technique should enable equalization of the delay among packets going to different destinations and therefore will enable packets that need to travel many hops to meet their delay and jitter specifications. It should be emphasized that the implementation is pertinent only to the Ethernet switch and since there is no signaling or encapsulation involved, it does not require standardization efforts.

Referring now to FIG. 2, two PE nodes 200, 202, connected by a single link 204 with no P nodes therebetween will be considered. T_(es) is the time at which a high-priority packet 206 enters an ingress buffer 208 of the sending node, e.g., the PE node 200; T_(s) is the time at which the packet 206 is serviced by a scheduler 210 of the sending node 200; T_(er) is the time at which the packet 206 enters an ingress buffer 212 of the receiving PE node 202; and T_(r) is the time at which the packet 206 is serviced by a scheduler 214 of the receiving node 202. By definition, the total delay (“T_(t)”) experienced by a packet 206 from ingress to egress is: T _(r) −T _(es)=(T _(r) −T _(er))+(T _(er) −T _(s))+(T _(s) −T _(es)) where (T_(r)−T_(er)) is the queuing delay at the receiving node 202; (T_(er)−T_(s)) is the transmission plus propagation delay via the link 204; and (T_(s)−T_(es)) is the queuing delay at the sending node 200.

Each node 200, 202, also includes a state machine 216, 218, respectively, for maintaining the state of two tables, i.e., a POS table and a Qmax table, which are described in detail below.

For a given LSP, the queuing delay is calculated by subtracting the transmission delay and the propagation delay from the total allowed delay estimate. This calculation is performed just once at the time of VPLS setup and is a simple calculation to perform.

There are certain constraints unique to TDM traffic transported over a VPLS network. First, the end-to-end maximum delay allowed for TDM traffic is 15 ms. This includes CE-PE, PE-PE, and PE-CE delays. The CE-PE and PE-CE delays will simply be propagation delays; that is, 5 μs/km. The PE-PE delays are as described above and will consist of queuing delays and transmission and propagation delays. Of these, the transmission and propagation delay can be estimated with close accuracy for a given point-to-point link with a given number of hops in between. Thus, the total end-to-end delay is known for each LSP. Second, TDM traffic is carried on point-to-point LSPs. Third, as previously noted, each PE node, such as the nodes PE1-PE5, has an input buffering scheme; that is, packets are queued at the input buffers before being scheduled. Finally, to avoid head-of-line blocking, each queue at a node, be it a PE node or a P node, is capable of an n-packet look-ahead to schedule packets that may be blocked behind a packet. Look-ahead is performed only when needed.

It will be assumed that the distance between PEs is proportional to the number of hops in between, although any other measure of distance, such as a knowledge of the actual distance, might be used.

FIG. 3 is a flowchart of the operation of one embodiment. In step 300, the maximum queuing delay allowed for a high-priority packet is divided into the number of hops the packet must traverse through the network. For example, assuming the total maximum queuing delay allowed is 12 ms, based on a total end-to-end delay allowed of 15 ms less 3 ms for the propagation and transmission delay for an average size packet. Assuming further that the packet will traverse three hops from source PE to destination (egress) PE, the total number of hops is equal to the number of P hops plus the ingress PE plus the egress PE, or five. Accordingly, the maximum queuing delay, on average, at each hop should not exceed 12 ms/5, or 2.4 ms; that is, the average queuing delay for the packet at each node should not exceed 2.4 ms. The method illustrated in FIG. 3 will ensure that this maximum delay at each node is not exceeded.

In step 302, at each P hop, a Qmax table, indicating the maximum queuing delay allowed at each hop for each of the destinations, is created. The maximum queuing delay allowed at each hop is determined by taking the maximum end-to-end queuing delay allowed (i.e., maximum end-to-end delay allowed less some amount for propagation and transmission delay (e.g., 3 ms)) and dividing it by the total number of hops along the way for that LSP, as determined in step 300. An exemplary Qmax table for the node PE1 of the network 100 (FIG. 1) is illustrated below in Table I. TABLE I Qmax Table Maximum Queuing Delay Destination PE Allowed at Each Hop PE2 Δ₂ PE3 Δ₃ PE4 Δ₄ PE5 Δ₅ Steps 300 and 302 are performed for each hop only once during LSP setup.

In step 304, a POS table is constructed. The POS table includes two values for every packet entering the ingress queue, including the time the packet entered the queue and the intended destination of the packet. As has been noted, the metro Ethernet switch permits an n-packet look-ahead in its high-priority ingress queue. Table II below illustrates an exemplary POS table. TABLE II POS Table Queue Position Time of Packet Entry Packet Destination Position 1 t1 PE4  Position 2 t2 PE7  Position 3 t3 PE12 Position 4 t4 PE15 The POS table of a node is updated each time a high-priority packet is added to its high-priority ingress queue.

From the Qmax table (Table I) and the POS table (Table II), the maximum queuing delay is allowed for each packet at each node can be determined. In step 306, using the example POS and Qmax tables set forth above, a combined table reflecting this information is created as shown in TABLE III below. TABLE III Combined Table Time Packet Must Exit Node to Position Time of Entry Meet Delay Requirements for Node Position 1 t1 t1 + Δ₄  Position 2 t2 t2 + Δ₇  Position 3 t3 t3 + Δ₁₂ Position 4 t4 t4 + Δ₁₅

In step 308, the packet in whichever position has the lowest, i.e., the first to occur, time in the third column of the combined table at the node is scheduled for transmission. For example, referring to the exemplary combined table set forth above, a determination is made which of the times (t1+Δ₄), (t2+Δ₇), (t3+Δ₁₂), and (t4+Δ₁₅) is the lowest and the packet corresponding thereto is scheduled by the scheduler through a four-packet look-ahead in order to meet the queuing delay constraint at that node. By attempting to meet the delay constraints at each of the intermediate nodes, the total end-to-end delay criterion will be met.

Thereafter, upon receipt of a high-priority packet at the node, in step 309, the POS table and combined table are updated in step 310 and execution returns to step 308.

It is believed that the operation and construction of the present invention will be apparent from the Detailed Description set forth above. While the exemplary embodiments of the invention shown and described have been characterized as being preferred, it should be readily understood that various changes and modifications could be made therein without departing from the scope of the present invention as set forth in the following claims. 

1. A method of scheduling high-priority packets in a metro Ethernet switch, the method comprising the steps of: determining a maximum queuing delay allowed for at least two high-priority packets in a queue in the switch; determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.
 2. The method of claim 1 wherein the step of determining the maximum queuing delay allowed comprises the steps of: creating a POS table that lists, for each high-priority packet that has entered the switch, a position of the high-priority packet in a queue of the switch, a time the high-priority packet entered the queue, and an intended destination of the high-priority packet; creating a Qmax table for storing a maximum allowed queuing delay for each of several possible intended destinations; and using the Qmax table and the POS table to determine the maximum queuing delay allowed for each of the high-priority packets in the queue of the switch.
 3. The method of claim 2 wherein the step of creating a Qmax table comprises the steps of, for each label switched path (“LSP”) between the switch and one of the possible intended destinations: determining a number of hops along the LSP; and dividing a maximum queuing delay allowed for the LSP by the number of hops along the LSP to determine the maximum queuing delay allowed for each hop.
 4. The method of claim 2 wherein the step of creating a Qmax table is performed only once during LSP setup.
 5. The method of claim 2 further comprising the step of updating the POS table each time a new high-priority packet enters the queue.
 6. The method of claim 1 wherein the steps of determining a maximum queuing delay allowed, determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed, and scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets are performed each time a new high-priority packet enters the queue.
 7. The method of claim 1 wherein the queue is capable of performing an n-packet look-ahead.
 8. A method of scheduling high-priority packets in a metro Ethernet switch, the method comprising the steps of: creating a first table that lists, for each high-priority packet that has entered the switch, a position of the high-priority packet in a queue of the switch, a time the high-priority packet entered the queue, and an intended destination of the high-priority packet; creating a second table for storing a maximum allowed queuing delay for each of several possible intended destinations; and using the first and second tables to determine the maximum queuing delay allowed for each of the high-priority packets in the queue of the switch.
 9. The method of claim 8 further comprising the step of: determining a maximum queuing delay allowed for at least two high-priority packets in a queue in the switch.
 10. The method of claim 9 further comprising the step of: determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed.
 11. The method of claim 10 further comprising the step of: scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.
 12. The method of claim 9 wherein the step of determining a maximum queuing delay allowed for at least two high-priority packets in a queue in the switch is performed with reference to the first and second tables.
 13. The method of claim 8 wherein the step of creating a second table comprises the steps of, for each label switched path (“LSP”) between the switch and one of the possible intended destinations: determining a number of hops along the LSP; and dividing a maximum queuing delay allowed for the LSP by the number of hops along the LSP to determine the maximum queuing delay allowed for each hop.
 14. The method of claim 8 wherein the step of creating a second table is performed only once during LSP setup.
 15. The method of claim 8 further comprising the step of updating the first table each time a new high-priority packet enters the queue.
 16. The method of claim 8 wherein the queue is capable of performing an n-packet look-ahead.
 17. Apparatus for scheduling high-priority packets in a metro Ethernet switch, the apparatus comprising: means for determining a maximum queuing delay allowed for at least two high-priority packets in a queue in the switch; means for determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and means for scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.
 18. The apparatus of claim 17 wherein the means for determining the maximum queuing delay allowed comprises: a POS table that lists, for each high-priority packet that has entered the switch, a position of the high-priority packet in a queue of the switch, a time the high-priority packet entered the queue, and an intended destination of the high-priority packet; means for creating a Qmax table for storing a maximum allowed queuing delay for each of several possible intended destinations; and means for using the Qmax table and the POS table to determine the maximum queuing delay allowed for each of the high-priority packets in the queue of the switch.
 19. The apparatus of claim 18 wherein the means for creating a Qmax table comprises, for each label switched path (“LSP”): means for determining a number of hops along the LSP; and means for dividing a maximum queuing delay allowed for the LSP by the number of hops along the LSP to determine the maximum queuing delay allowed for each hop.
 20. The apparatus of claim 18 wherein the Qmax table is created during LSP setup.
 21. The apparatus of claim 18 further comprising means for updating the POS table each time a new high-priority packet enters the queue.
 22. The apparatus of claim 17 wherein the queue is capable of performing an n-packet look-ahead.
 23. A packet switch comprising: a queue containing a plurality of packets received at the switch; and a scheduler for scheduling transmission of the packets in the queue, wherein when the queue contains at least two high-priority packets, the scheduler schedules the one of the at least two high-priority packets determined to have a smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.
 24. The packet switch of claim 23 further comprising a state machine for: maintaining a POS table that lists, for each high-priority packet that has entered the switch, a position of the high-priority packet in a queue of the switch, a time the high-priority packet entered the queue, and an intended destination of the high-priority packet; and maintaining a Qmax table for storing a maximum allowed queuing delay for each of several possible intended destinations.
 25. The packet switch of claim 24 wherein the scheduler uses the Qmax table and the POS table to determine the maximum queuing delay allowed for each of the high-priority packets in the queue of the switch.
 26. The packet switch of claim 24 wherein the maximum allowed queuing delay for each of several possible intended destinations is determined by determining a number of hops along the LSP and dividing a maximum queuing delay allowed for the LSP by the number of hops along the LSP to determine the maximum queuing delay allowed for each hop. 